On Matroid Representability and Minor Problems
نویسنده
چکیده
In this paper we look at complexity aspects of the following problem (matroid representability) which seems to play an important role in structural matroid theory: Given a rational matrix representing the matroid M , the question is whether M can be represented also over another specific finite field. We prove this problem is hard, and so is the related problem of minor testing in rational matroids. The results hold even if we restrict to matroids of branch-width three.
منابع مشابه
A short proof of non-GF(5)-representability of matroids
Tutte proved that a matroid is binary if and only if it does not contain a U2;4-minor. This provides a short proof for non-GF(2)-representability in that we can verify that a given minor is isomorphic to U2;4 in just a few rank evaluations. Using excluded-minor characterizations, short proofs can also be given of non-representablity over GF(3) and over GF(4). For GF(5), it is not even known whe...
متن کاملThe Excluded Minors for GF(4)-Representable Matroids
The definitions of these matroids, with a summary of their interesting properties, can be found in the Appendix. Except for P"8 , they were all known to be excluded minors for GF(4)-representability (see Oxley [15, 17]). The matroid P"8 is obtained by relaxing the unique pair of disjoint circuit-hyperplanes of P8 . Ever since Whitney's introductory paper [28] on matroid theory, researchers have...
متن کاملMatroids Representable Over Fields With a Common Subfield
A matroid is GF(q)-regular if it is representable over all proper superfields of the field GF(q). We show that, for highly connected matroids having a large projective geometry over GF(q) as a minor, the property of GF(q)-regularity is equivalent to representability over both GF(q) and GF(q) for some odd integer t ≥ 3. We do this by means of an exact structural description of
متن کاملOn the Representability of the Biuniform Matroid
Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matroid is an open problem too. The interest of these problems is due to their implications to secret sharing. Efficient methods to find representation...
متن کاملAn excluded minors method for infinite matroids
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift m...
متن کامل